Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
نویسنده
چکیده
A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are recognizable. Furthermore, we prove that in certain useful cases, recognizable tree languages are closed under union and intersection. To compare with early related work, e.g. [7], we discuss the relationship between linear bounded automata and equational tree automata. As a consequence, we obtain some (un)decidability results. We further present a hierarchy of 4 classes of tree languages.
منابع مشابه
On Closure under Complementation of Equational Tree Automata for Theories Extending AC
We study the problem of closure under complementation of languages accepted by one-way and two-way tree automata modulo equational theories. We deal with the equational theories of commutative monoids ( ), idempotent commutative monoids ( ), Abelian groups ( ), and the theories of exclusive-or ( ), generalized exclusive-or ( ), and distributive minus symbol ( ). While the one-way automata for a...
متن کاملTwo-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties
We study two-way tree automata modulo equational theories. We deal with the theories of Abelian groups (ACUM ), idempotent commutative monoids (ACUI), and the theory of exclusive-or (ACUX), as well as some variants including the theory of commutative monoids (ACU ). We show that the one-way automata for all these theories are closed under union and intersection, and emptiness is decidable. For ...
متن کاملACTAS: Associative and Commutative Tree Automata Simulator
ACTAS is a tool set manipulating associative and commutative tree automata (AC-tree automata for short). The system is equipped with various functions for Boolean operations and rewrite descendant computation. This functionality allows to verify safety property in infinite state models, which is helpful in the domain of network security, in particular, for security problems of cryptographic pro...
متن کاملOn the Complexity of Equational Horn Clauses
Security protocols employing cryptographic primitives with algebraic properties are conveniently modeled using Horn clauses modulo equational theories. We consider clauses corresponding to the class H3 of Nielson, Nielson and Seidl. We show that modulo the theory ACU of an associative-commutative symbol with unit, as well as its variants like the theory XOR and the theory AG of Abelian groups, ...
متن کاملACTAS : A System Design for Associative and Commutative Tree Automata Theory
ACTAS is an integrated system for manipulating associative and commutative tree automata (AC-tree automata for short), that has various functions such as for Boolean operations of AC-tree automata, computing rewrite descendants, and solving emptiness and membership problems. In order to deal with high-complexity problems in reasonable time, overand under-approximation algorithms are also equipp...
متن کامل